Implicit flows in malicious and nonmalicious code

نویسندگان

  • Alejandro Russo
  • Andrei Sabelfeld
  • Keqin Li
چکیده

Information-flow technology is a promising approach for ensuring security by design and construction. When tracking information flow, of particular concern are implicit flows, i.e., flows through control flow when computation branches on secret data and performs publicly observed side effects depending on which branch is taken. The large body of literature exercises two extreme views on implicit flows: either track them (striving to show that there are no leaks, and often running into the problem of complex enforcement mechanisms and false alarms), or not track them (which reduces false alarms, but provides weak or no security guarantees). This paper distinguishes between malicious and nonmalicious code. The attacker may exploit implicit flows with malicious code, and so they should be tracked. We show how this can be done by a security type system and by a monitor. For nonmalicious code, we explore a middle ground between the two extremes. We observe that implicit flows are often harmless in nonmalicious code: they cannot be exploited to efficiently leak secrets. To this end, we are able to guarantee strong informationflow properties with a combination of an explicit-flow and a graph-pattern analyses. Initial studies of industrial code (secure logging and data sanitization) suggest that our approach has potential of offering a desired combination of a lightweight analysis, strong security guarantees, and no excessive false alarms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Turbulent Flow in 2-D Domains with Complex Geometry-Finite Elelment Method

Using the highly recommended numerical techniques, a finite element computer code is developed to analyse the steady incompressible, laminar and turbulent flows in 2-D domains with complex geometry. The Petrov-Galerkin finite element formulation is adopted to avoid numerical oscillations. Turbulence is modeled using the two equation k-ω model. The discretized equations are written in the form o...

متن کامل

Turbulent Flow in 2-D Domains with Complex Geometry-Finite Elelment Method

Using the highly recommended numerical techniques, a finite element computer code is developed to analyse the steady incompressible, laminar and turbulent flows in 2-D domains with complex geometry. The Petrov-Galerkin finite element formulation is adopted to avoid numerical oscillations. Turbulence is modeled using the two equation k-ω model. The discretized equations are written in the form o...

متن کامل

Development of an Implicit Numerical Model for Calculation of Sub and Super Critical Flows

A two dimensional numerical model of shallow water equations was developed tocalculate sub and super-critical open channel flows. Utilizing an implicit scheme the steady stateequations were discretized based on control volume method. Collocated grid arrangement was appliedwith a SIMPLEC like algorithm for depth-velocity coupling. Power law scheme was used fordiscretization of convection and dif...

متن کامل

A case study of flood dynamic wave simulation in natural waterways using numerical solution of unsteady flows

Flood routing has many applications in engineering projects and helps designers in understanding the flood flow characteristics in river flows. Floods are taken unsteady flows that vary by time and location. Equations governing unsteady flows in waterways are continuity and momentum equations which in case of one-dimensional flow the Saint-Venant hypothesis is considered. Dynamic wave model as ...

متن کامل

A Probabilistic Characterization of Random and Malicious Communication Failures in Multi-Hop Networked Control

The control problem of a linear discrete-time dynamical system over a multi-hop network is explored. The network is assumed to be subject to packet drops by malicious and nonmalicious nodes as well as random and malicious data corruption issues. We utilize asymptotic tail-probability bounds of transmission failure ratios to characterize the links and paths of a network as well as the network it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010